Too Many Minor Order Obstructions ( For Parameterized Lower
نویسنده
چکیده
We study the growth rate on the number obstructions (forbidden minors) for families of graphs that are based on parameterized graph problems. Our main result shows that if the de ning graph problem is NP-complete then the growth rate on the number of obstructions must be super-polynomial or else the polynomial-time hierarchy must collapse to P 3 . We illustrate the rapid growth rate of parameterized lower ideals by computing (and counting) the obstructions for the graph families with independence plus size at most k, k 12.
منابع مشابه
FPT Is Characterized by Useful Obstruction Sets
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one way of obtaining strongly uniform FPT algorithms, but that all of FPT may be captured in this way. Our new characterization of FPT has a strong connection to...
متن کاملObstructions to Within a Few Vertices or Edges of
Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for nding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approa...
متن کاملOpen Problems related to computing obstruction sets
Robertson and Seymour proved Wagner’s famous Conjecture and showed that every minor ideal has a polynomial time decision algorithm. The algorithm uses the obstructions of the minor ideal. By Robertson and Seymour’s proof we know that there are only finitely many such obstructions. Nevertheless, the proof is non-constructive and for many minor ideals we do not know the obstructions. Since the 19...
متن کاملGastrografin-based conservative approach to small bowel obstructions: too far from a daily use
As known, small bowel obstruction is one of the most common emergencies in general surgery carrying a not negligible rate of morbidity and financial expenditures as far as high social impact . Peritoneal adhesions are the leading cause of intestinal obstruction up to 74% of cases. In spite of increasing incidence worldwide, current management still presents some “blind corners”, whose aspects s...
متن کاملObstructions to Within a Few Vertices or Edges of Acyclic
Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for nding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approa...
متن کامل